Inference by Clause Linking
نویسندگان
چکیده
We present a novel theorem proving method based on the idea of never combining parts of different assertions (clauses) into a single assertion. This avoids some comb ina,. torial problems with other existing strategies. We mention some refinements of this idea which improve its performance. Results of an implementation are discussed, including tests on logic puzzles, set theory problems, and temporal logic theorems. We discuss methods used to make the prover self-controlling to an unusually high degree so that novice users need not specify which strategy to use. The system is particularly suited to the incorporation of specialized decision procedures. This and other extensions are discussed. Also, this work is placed in the context of general issues and developments in theorem proving and artificial intelligence. This paper is an extended version of a chapter to appear in the book INTELLIGENT SYSTEMS: State of the art and future directions by Zbiguiew Ras and Maria Zemankova.
منابع مشابه
Kelpie: a Concurrent Logic Programming System for Knowledge Based Applications
A software architecture that interfaces a concurrent logic programming system to a Prolog database machine is described. The concurrent logic programming system connects a guarded clause inference engine with a definite clause inference engine to support concurrent execution of mutually invoking guarded and definite clause programs. An interface to a Prolog database machine allows the concurren...
متن کاملMax-planck-institut F Ur Informatik Ordered Semantic Hyper-linking K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
We propose a method for combining the clause linking theorem proving method with theorem proving methods based on orderings This may be useful for incorporating term rewriting based approaches into clause linking In this way some of the proposi tional ine ciencies of ordering based approaches may be overcome while at the same time incorporating the advantages of ordering methods into clause lin...
متن کاملA parallel inference model for logic programming
In this paper, we describe a parallel inference model for logic programming on general-purpose multicomputers. In the model, input clauses are partitioned into subsets, and resolution is conducted on each subset concurrently. The partitions are dynamically adjusted via clause migration as inference proceeds. This allows each processor to work on virtually the whole clause set while a shorter re...
متن کاملFormal Linking in Internally-Headed Relatives
This paper aims to clarify and resolve issues surrounding the so-called formal linking problem in interpreting the Internally Headed Relative Clause construction in Korean and Japanese, a problem that has been identified in recent E-type pronominal treatments of the construction (e.g., Hoshi 1995, Shimoyama 1999). In the literature, this problem refers to the difficulty of capturing the delimit...
متن کاملAutomated Reasoning with Extended Linking and Left Merging
Eztended Linking Strategy(ELS) is a hyper-style strategy whose underlying principle is to control and perform (extend) a series of standard resolution clauses. However it may be treated as a unique inference rule that serially links several resolution steps into one. We have defined the clause chain, introduced the ideas of ELS with left merging (LELS). We also presented the soundness and compl...
متن کاملBDDs, Horn Clauses and Resolution
In this research we present the utilization of BDDs in representing propositional logic programs and implementing the refutation by resolution deduction method. A logic program is a collection of axioms from which a goal clause can be proven. Axioms are written in a standard form known as Horn clauses. In logic programming, we try to find a collection of axioms and inference steps that imply th...
متن کامل